A General Lower Bound for Collaborative Tree Exploration

نویسندگان

  • Yann Disser
  • Frank Mousset
  • Andreas Noever
  • Nemanja Skoric
  • Angelika Steger
چکیده

We consider collaborative graph exploration with a set of k agents. All agents start at a common vertex of an initially unknown graph and need to collectively visit all other vertices. We assume agents are deterministic, vertices are distinguishable, moves are simultaneous, and we allow agents to communicate globally. For this setting, we give the first non-trivial lower bounds that bridge the gap between small (k ≤ √n) and large (k ≥ n) teams of agents. Remarkably, our bounds tightly connect to existing results in both domains. First, we significantly extend a lower bound of Ω(log k/ log log k) by Dynia et al. on the competitive ratio of a collaborative tree exploration strategy to the range k ≤ n logc n for any c ∈ N. Second, we provide a tight lower bound on the number of agents needed for any competitive exploration algorithm. In particular, we show that any collaborative tree exploration algorithm with k = Dn agents has a competitive ratio of ω(1), while Dereniowski et al. gave an algorithm with k = Dn agents and competitive ratio O(1), for any ε > 0 and with D denoting the diameter of the graph. Lastly, we show that, for any exploration algorithm using k = n agents, there exist trees of arbitrarily large height D that require Ω(D) rounds, and we provide a simple algorithm that matches this bound for all trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Upper Bound on the First Zagreb Index in Trees

In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.

متن کامل

Average Costs of a Graph Exploration: Upper and Lower Bounds

We consider the exploration of random graphs. We give upper and lower bounds for the expected number of edges traversed during an exploration. This result implies a lower bound for the expected running time of a wide class of algorithms { e.g. Breadth-First-Search, Depth-First-Search, and algorithms to determine a minimum spanning tree or to solve the single source shortest paths problem in a w...

متن کامل

Neural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree

In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...

متن کامل

An efficient method for asynchronous distributed constraint optimization using upper and lower bound

Distributed constraint optimization problem (DCOP) is an important area of study of multi-agents. Recently, a distributed search algorithm for DCOP is proposed. The algorithm enables asynchronous search based on blanch-and-bound and depth first tree. However, the algorithm has overhead of backtracking and re-exploration. In this paper, some effective methods which reduce overhead of former algo...

متن کامل

An adaptive algorithm for the Euclidean Steiner tree problem in d-space

We describe a technique to improve Smith’s branch-and-bound algorithm for the Euclidean Steiner tree problem inRd . The algorithm relies on the enumeration and optimization of full Steiner topologies for corresponding subsets of regular points. We handle the case of two Steiner points colliding during the optimization process—that is when there is a small enough distance between them—to dynamic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017